The deformed consensus protocol
نویسندگان
چکیده
منابع مشابه
The deformed consensus protocol
This paper studies a generalization of the standard continuous-time consensus protocol, obtained by replacing the Laplacian matrix of the communication graph with the so-called deformed Laplacian. The deformed Laplacian is a second-degree matrix polynomial in the real variable s which reduces to the standard Laplacian for s equal to unity. The stability properties of the ensuing deformed consen...
متن کاملThe Deformed Consensus Protocol: Extended Version
This paper studies a generalization of the standard continuous-time consensus protocol, obtained by replacing the Laplacian matrix of the communication graph with the so-called deformed Laplacian. The deformed Laplacian is a second-degree matrix polynomial in the real variable s which reduces to the standard Laplacian for s equal to unity. The stability properties of the ensuing deformed consen...
متن کاملThe Ripple Protocol Consensus Algorithm
While several consensus algorithms exist for the Byzantine Generals Problem, specifically as it pertains to distributed payment systems, many suffer from high latency induced by the requirement that all nodes within the network communicate synchronously. In this work, we present a novel consensus algorithm that circumvents this requirement by utilizing collectively-trusted subnetworks within th...
متن کاملAnalysis of the XRP Ledger Consensus Protocol
The XRP Ledger Consensus Protocol is a previously developed consensus protocol powering the XRP Ledger. It is a low-latency Byzantine agreement protocol, capable of reaching consensus without full agreement on which nodes are members of the network. We present a detailed explanation of the algorithm and derive conditions for its safety and liveness.
متن کاملA Priority-Based Consensus Protocol
Consensus is a basic agreement problem whose solutions are fundamental for building fault-tolerant distributed systems. Consensus for real-time systems is usually designed under strong timing assumptions, which state that there are upper bounds on both processing and message transmission times. Since violating these bounds may compromise safety, such systems are usually implemented based on pes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automatica
سال: 2013
ISSN: 0005-1098
DOI: 10.1016/j.automatica.2013.07.006